I/O efficient path traversal in well-shaped tetrahedral meshes
نویسنده
چکیده
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ lgB) I/O operations in the external memory model. As applications of our structure we show how to efficiently perform axis parallel box queries and how to report the intersection of M with an arbitrarily oriented plane.
منابع مشابه
External Memory Algorithms For Path Traversal in Graphs
This thesis will present a number of results related to path traversal in trees and graphs. In particular, we focus on data structures which allow such traversals to be performed efficiently in the external memory setting. In addition, for trees and planar graphs the data structures we present are succinct. Our tree structures permit efficient bottom-up path traversal in rooted trees of arbitra...
متن کاملPlanar Graph Blocking for External Searching 1
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves the previous results for planar graphs with bounded face size. We also prove an upper bound on I-O efficiency of any storage scheme for well-shaped triangulated meshes. For these meshes, our storage scheme achieves opti...
متن کاملStreaming Simplification of Tetrahedral Meshes
Unstructured tetrahedral meshes are commonly used in scientific computing to represent scalar, vector, and tensor fields in three dimensions. Visualization of these meshes can be difficult to perform interactively due to their size and complexity. By reducing the size of the data, we can accomplish real-time visualization necessary for scientific analysis. We propose a two-step approach for str...
متن کاملExistence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes
This paper addresses the existence and construction of Hamiltonian paths and Hamiltonian cycles on conforming tetrahedral meshes. The paths and cycles are constrained to pass from one tetrahedron to the next one through a vertex. For conforming tetrahedral meshes, under certain conditions which are normally satisfied in finite-element computations, we show that there exists a through-vertex Ham...
متن کاملMultiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes
We study the simplification of triangular and tetrahedral meshes using techniques based on successive edge collapses, as well as the exploitation of the generated multiple levels of detail for the effective processing of the models. Regarding triangular meshes, we present a method for the construction of progressive hulls, by suitable edge collapses; we use the generated hulls for the accelerat...
متن کامل